nearest-neighbour methods
- nearest-neighbour methods
French\ \ analyse des plus proches voisins
German\ \ Nächste-Nachbarn-Methoden
Dutch\ \ naaste-buuranalyse
Italian\ \ analisi del vicino più prossimo
Spanish\ \ análisis de vecindad más cercana
Catalan\ \ mètodes de veïnat més proper
Portuguese\ \ métodos dos vizinhos mais próximos
Romanian\ \ -
Danish\ \ -
Norwegian\ \ -
Swedish\ \ närmaste-grannemetod
Greek\ \ μέθοδοι κοντινότερου γείτονα
Finnish\ \ lähimmän naapurin menetelmät
Hungarian\ \ legközelebbi szomszédos módszerek
Turkish\ \ en yakın komşu yöntemleri
Estonian\ \ lähima naabri meetodid
Lithuanian\ \ artimiausiųjų kaimynų metodai
Slovenian\ \ -
Polish\ \ metody najbliższych sąsiadów
Russian\ \ методы ближайшего соседа
Ukrainian\ \ Метод найближчого сусіда
Serbian\ \ методи најближег суседа
Icelandic\ \ næsta-nágranni aðferðir
Euskara\ \ gertueneko bizilaguna-metodoak
Farsi\ \ -
Persian-Farsi\ \ برآورد بر اساس همسايه نزديک
Arabic\ \ طرق الجيران الاقرب
Afrikaans\ \ naastebuurpunt-metodes
Chinese\ \ 最 近 邻 方 法
Korean\ \ 최근접이웃방법
Statistical terms.
2014.
Look at other dictionaries:
k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… … Wikipedia
Decoding methods — In communication theory and coding theory, decoding is the process of translating received messages into codewords of a given code. There has been many common methods of mapping messages to codewords. These are often used to recover messages sent … Wikipedia
AGRICULTURAL LAND-MANAGEMENT METHODS AND IMPLEMENTS IN ANCIENT EREẒ ISRAEL — Ereẓ Israel is a small country with a topographically fragmented territory, each geographical region having a distinctive character of its own. These regions include: the coastal plain, the lowlands, the hilly country, the inland valleys, the… … Encyclopedia of Judaism
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Predictive analytics — encompasses a variety of techniques from statistics and data mining that analyze current and historical data to make predictions about future events. Such predictions rarely take the form of absolute statements, and are more likely to be… … Wikipedia
amorphous solid — ▪ physics Introduction any noncrystalline solid in which the atoms and molecules are not organized in a definite lattice pattern. Such solids include glass, plastic, and gel. Solids and liquids (liquid) are both forms of condensed… … Universalium
Scale-invariant feature transform — Feature detection Output of a typical corner detection algorithm … Wikipedia
Z-order curve — Not to be confused with Z curve or Z order. Four iterations of the Z order curve … Wikipedia
Nucleic acid thermodynamics — is the study of the thermodynamics of nucleic acid molecules, or how temperature affects nucleic acid structure. For multiple copies of DNA molecules, the melting temperature (Tm) is defined as the temperature at which half of the DNA strands are … Wikipedia
Curse of dimensionality — The curse of dimensionality refers to various phenomena that arise when analyzing and organizing high dimensional spaces (often with hundreds or thousands of dimensions) that do not occur in low dimensional settings such as the physical space… … Wikipedia
